منابع مشابه
Random walks on complex trees.
We study the properties of random walks on complex trees. We observe that the absence of loops is reflected in physical observables showing large differences with respect to their looped counterparts. First, both the vertex discovery rate and the mean topological displacement from the origin present a considerable slowing down in the tree case. Second, the mean first passage time (MFPT) display...
متن کاملRandom Walks on Rooted Trees
For arbitrary positive integers h and m, we consider the family of all rooted trees of height h having exactly m vertices at distance h from the root. We refer to such trees as (h,m)-trees. For a tree T from this family, we consider a simple random walk on T which starts at the root and terminates when it visits one of the m vertices at distance h from the root. Consider the problem of finding ...
متن کاملRandom Walks and Trees
These notes provide an elementary and self-contained introduction to branching random walks. Section 1 gives a brief overview of Galton–Watson trees, whereas Section 2 presents the classical law of large numbers for branching random walks. These two short sections are not exactly indispensable, but they introduce the idea of using size-biased trees, thus giving motivations and an avant-goût to ...
متن کاملRandom Walks & Trees
Preface These notes provide an elementary and self-contained introduction to branching random walks. Chapter 1 gives a brief overview of Galton–Watson trees, whereas Chapter 2 presents the classical law of large numbers for branching random walks. These two short chapters are not exactly indispensable, but they introduce the idea of using size-biased trees, thus giving motivations and an avant-...
متن کاملRandom Walks and Random Spanning Trees
We explore algorithms for generating random spanning trees. We first study an algorithm that was developed independently by David Alduous [1] and Andrei Broder [2]. The algorithm uses a a simple random walk in which edges that correspond to the first visit to vertices are added to the spanning tree. Analysis was inspired by Andrei Broder’s paper. Additionally, we study an algorithm by David Wil...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Australian Mathematical Society
سال: 1973
ISSN: 0004-9735
DOI: 10.1017/s144678870001274x